Automatically Generating Flow Shop Simulation Models from Sap Data
نویسندگان
چکیده
Automatic model generation, the consequential reduction of problem solving cycles and the need for a higher degree of data integration have long been characterized as significant challenges in the field of simulation of manufacturing systems. Especially operationally used manufacturing simulation models require a high degree of modeling detail and thus depend on a significant amount of input data. In many cases, the time and effort required to manually build such a detailed model and keeping it up-to-date are prohibitive. This paper describes a practical case in which entire simulation models of a complex and large scale automotive flow shop production were automatically created from an automotive company’s SAP and MES systems in order to support operational planning purposes and reduce operational logistical risks, such as production disruptions caused by stock-out situations at the manufacturing line.
منابع مشابه
Improving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment
Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...
متن کاملA New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملWater use pattern and canopy processes of cashew trees during a drying period in West Africagoo
Water flux in a young, 4-year old, cashew (Anacardium occidentale L.) plantation was studied over a dry season, from November 2001 to March 2002, in the forest-savannah transition zone of Ghana, West Africa. The temperature-difference method was used over this five-month period to quantify the diurnal and day-to-day whole-tree sap flow (Qt) and hence the canopy scale transpiration (Ec). M...
متن کاملThree heuristic procedures for the stochastic, two-machine flow shop problem
Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained a challenge. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experimen...
متن کامل